A weighted extension of Fibonacci numbers
نویسندگان
چکیده
We extend Fibonacci numbers with arbitrary weights and generalize a dozen identities. As special case, we propose an elliptic extension which extends the q-Fibonacci polynomials appearing in Schur's work. The proofs of most identities are combinatorial, extending given by Benjamin Quinn, q-case, Garrett. Some proved telescoping.
منابع مشابه
Energy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملFibonacci Numbers
One can prove the following three propositions: (1) For all natural numbers m, n holds gcd(m,n) = gcd(m, n + m). (2) For all natural numbers k, m, n such that gcd(k, m) = 1 holds gcd(k,m · n) = gcd(k, n). (3) For every real number s such that s > 0 there exists a natural number n such that n > 0 and 0 < 1 n and 1 n ¬ s. In this article we present several logical schemes. The scheme Fib Ind conc...
متن کاملRestricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.
متن کاملGENERALIZED q - FIBONACCI NUMBERS
We introduce two sets of permutations of {1, 2, . . . , n} whose cardinalities are generalized Fibonacci numbers. Then we introduce the generalized q-Fibonacci polynomials and the generalized q-Fibonacci numbers (of first and second kind) by means of the major index statistic on the introduced sets of permutations.
متن کاملkFm In Fibonacci Numbers
Let {Fn}n=1 = {1, 1, 2, 3, . . .} be the sequence of Fibonacci numbers. In this paper we give some sufficient conditions on a natural number k such that the equation Fn = kFm is solvable with respect to the unknowns n and m. We also show that for k > 1 the equation Fn = kFm has at most one solution (n, m).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Difference Equations and Applications
سال: 2023
ISSN: ['1026-7042', '1563-5120', '1023-6198']
DOI: https://doi.org/10.1080/10236198.2023.2251594